On (1, $$\epsilon $$ ϵ )-Restricted Max–Min Fair Allocation Problem

On ($1$, $ε$)-Restricted Max-Min Fair Allocation Problem

We study the max-min fair allocation problem in which a set of m indivisible items are to be distributed among n agents such that the minimum utility among all agents is maximized. In the restricted setting, the utility of each item j on agent i is either 0 or some non-negative weight wj . For this setting, Asadpour et al. [2] showed that a certain configuration-LP can be used to estimate the o...

On $(1,\epsilon)$-Restricted Assignment Makespan Minimization

Makespan minimization on unrelated machines is a classic problem in approximation algorithms. No polynomial time (2 − δ)-approximation algorithm is known for the problem for constant δ > 0. This is true even for certain special cases, most notably the restricted assignment problem where each job has the same load on any machine but can be assigned to one from a specified subset. Recently in a b...

Maxmin fair scheduling in wireless networks

We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints. We propose a fair scheduling which assigns dynamic weights to the flows such that the weights depend on the congestion in the neighborhood and schedule the flows which constitute a maximum weighted matching. It is possi...

Maxmin Fair S heduling in Wireless Networks

MaxMin Fair Flow Control Sensitive to Priorities

Flow control is the dominant technique currently used in communication networks for preventing excess traffic from flooding the network, and for handling congestion. In ratebased flow control, transmission rates of sessions are adjusted in an end-to-end manner through a sequence of operations. In this work, we present a theory of max-min fair, ratebased flow control sensitive to priorities of d...